The cofinality of the saturated uncountable random graph

نویسنده

  • Steve Warner
چکیده

Assuming CH, let Γω1 be the saturated random graph of cardinality ω1. In this paper we prove that it is consistent that cf(Aut(Γω1)) and 2ω1 can be any two prescribed regular cardinals subject only to the requirement ω1 < cf(Aut(Γω1)) ≤ 2ω1 .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The uncountable cofinality of the automorphism group of the countable universal distributive lattice

We show that the automorphism group of the countable universal distributive lattice has strong uncountable cofinality, and we adapt the method to deduce the strong uncountable cofinality of the automorphism group of the countable universal generalized boolean algebra.

متن کامل

On the Cofinality of Infinite Partially Ordered Sets: Factoring a Poset into Lean Essential Subsets

We study which infinite posets have simple cofinal subsets such as chains, or decompose canonically into such subsets. The posets of countable cofinality admitting such a decomposition are characterized by a forbidden substructure; the corresponding problem for uncountable cofinality remains open.

متن کامل

Successors of singular cardinals and coloring theorems {II}

In this paper, we investigate the extent to which techniques used in [8], [2], and [3] — developed to prove coloring theorems at successors of singular cardinals of uncountable cofinality — can be extended to cover the countable cofinality case.

متن کامل

Saturated Filters at Successors of Singulars, Weak Reflection and Yet Another Weak Club Principle

Suppose that λ is the successor of a singular cardinal μ whose cofinality is an uncountable cardinal κ. We give a sufficient condition that the club filter of λ concentrating on the points of cofinality κ is not λ-saturated. The condition is phrased in terms of a notion that we call weak reflection. We discuss various properties of weak reflection. We introduce a weak version of the ♣-principle...

متن کامل

Uncountable cofinalities of automorphism groups of linear and partial orders

We demonstrate the uncountable cofinality of the automorphism groups of various linear and partial orders. We also relate this to the ‘Bergman’ property, and discuss cases where this may fail even though the cofinality

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Arch. Math. Log.

دوره 43  شماره 

صفحات  -

تاریخ انتشار 2004